Weighted Automata on Infinite Words in the Context of Attacker-Defender Games
نویسندگان
چکیده
The paper is devoted to several infinite-state Attacker-Defender games with reachability objectives. We prove the undecidability of checking for the existence of a winning strategy in several low-dimensional mathematical games including vector reachability games, word games and braid games. To prove these results, we consider a model of weighted automata operating on infinite words and prove that the universality problem is undecidable for this new class of weighted automata. We show that the universality problem is undecidable by using a non-standard encoding of the infinite Post correspondence problem.
منابع مشابه
Secure Programming via Safety Games
Writing secure programs remains an open, challenging, and important problem. However, new operating systems allow application programs to write secure programs with a tractable amount of effort. Such systems define a notion of privilege and provide a set of system calls, or primitives, that a program can invoke to manage its privilege and the privileges of other programs with which it interacts...
متن کاملComputing Solutions in Infinite-Horizon Discounted Adversarial Patrolling Games
Stackelberg games form the core of a number of tools deployed for computing optimal patrolling strategies in adversarial domains, such as the US Federal Air Marshall Service and the US Coast Guard. In traditional Stackelberg security game models the attacker knows only the probability that each target is covered by the defender, but is oblivious to the detailed timing of the coverage schedule. ...
متن کاملSecurity Games with Multiple Attacker Resources
Algorithms for finding game-theoretic solutions are now used in several real-world security applications. This work has generally assumed a Stackelberg model where the defender commits to a mixed strategy first. In general two-player normal-form games, Stackelberg strategies are easier to compute than Nash equilibria, though it has recently been shown that in many security games, Stackelberg st...
متن کاملSequential, nonzero-sum "Blotto": Allocating defensive resources prior to attack
The strategic allocation of resources across multiple fronts has long been studied in the context of Blotto games in which two players simultaneously select their allocations. But many allocation problems are sequential. For example, a state trying to defend against a terrorist attack generally allocates some or all of its resources before the attacker decides where to strike. This paper studie...
متن کاملGeometric Security Games
There are many real world scenarios which can be modeled as a security game where there is one player, called the defender, trying to protect a set of potential targets from another player, called the attacker. Game-theoretic security approaches are currently used to set up traffic checkpoints and canine patrols at LAX airport [38, 37], to assign Federal Air Marshals to flights [43], and will s...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Inf. Comput.
دوره 255 شماره
صفحات -
تاریخ انتشار 2015